Performance Analysis of DSR and OLSR Routing Protocols for Fixed Wireless Sensor Networks (WSN)

Wireless Sensor Network (WSN) has been regarded as a distinguished Ad Hoc Network that can be used to fulfil multiple tasks and applications. Since a WSN consists hundreds of small size, low cost and battery powered sensor nodes. These nodes have the event sensing capabilities, data processing capabilities. Number of routing protocols has been implemented to perform routing in these networks. In this paper, an attempt have been made to evaluate the performance of OLSR and DSR routing protocol using Random Waypoint model, and also investigate how well these selected protocols performs on WSNs, in static environments, using OPNET 16.0 Simulation tool. The performance analysis of these protocols will focus on the impact of the network size and the number of nodes. The performance metrics used in this work are throughput, average end-to-end delay and network load. Keywords— Ad-hoc network, OLSR, DSR, MANET, OPNET Simulation, WSN • Introduction Wireless sensors network (WSN) is the collection of homogenous, self organized nodes known as sensor nodes. These nodes have the event sensing capabilities, data processing capabilities. The components of sensor node are integrated on a single or multiple boards, and packaged in a few cubic inches. A wireless sensor network consists of few to thousands of nodes which communicate through wireless channels for information sharing and cooperative processing. A user can retrieve information of his/her interest from the wireless sensor network by putting queries and gathering results from the base stations or sink nodes. The base stations in wireless sensor networks behave as an interface between users and the network. Wireless sensor networks can also be considered as a distributed database as the sensor networks can be connected to the Internet, through which global information sharing becomes feasible. Wireless Sensor Networks consist of number of individual nodes that are able to interact with the environment by sensing physical parameter or controlling the physical parameters, these nodes have to collaborate in order to fulfill their tasks as usually, a single node is incapable of doing so and they use wireless communication to enable this collaboration. Figure 1. Wireless Sensor Network • Literature Review In recent years, several researchers have analyzed and compare various ad-hoc Routing Protocols taking into consideration different performance metrics as basis for performance evaluation. They have used different simulators and simulation models for the same. Chowdhury, S.I et al [2]: evaluates the communication performance of the DSR and OLSR. The DSR protocol performs better with static traffic and limited number of source and destination pairs for each host. It requires fewer resources than OLSR as the control messages size and the route table is small reducing the computational power. In high density networks with highly sporadic traffic, OLSR performs better. But the best situation is when the between a large number of hosts. The quality metrics are easy to incorporate International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 783 www.ijergs.org into current protocol. OLSR requires continuous bandwidth to receive the topology updates messages. In both protocols scalability is restricted due to their proactive or reactive characteristic. Vidhale et. al. [6] evaluates three routing protocols which are DSDV, AODV and DSR. DSDV has low throughput but also has high routing load compared to AODV and DSR. Both AODV and DSR protocols perform very well. Although in some situations AODV outperforms DSR, DSR has the best performance especially when evaluated based on the average end to end delay. Moreover, changing the packet size doesn’t affect the performance of DSDV but affects the performance of AODV and DSR. All protocols perform well when they are evaluated based on the mobility of the nodes. Ding Y et al. [8] evaluate and improve the performance of the AODV and OLSR routing protocols under two realistic mobility models for VANET. OMNET++ simulator is used for performance evaluation. The main objective of this work is improves the communication performance of routing protocols by increasing the density around the receiver. In their work, authors also analyze the properties of the two mobility models in high density urban areas. Finally after the simulation result, authors concluded that the performance of AODV is better than OLSR and OLSR routing protocol seem more affected by the density than AODV, the reason behind is that proactive routing protocol maintains the entire network topology while reactive routing protocol create routes when they need. • WSN Routing Protocols Routing is a mechanism to establish and to select a specific path in order to send data from source to destination. There are various routing algorithm designed for ad-hoc networks. The protocols for WSN routing can be classified as: • Proactive Routing Protocols: Proactive (table-driven) protocols allow a network node to maintain the routing table to store topology information about all other nodes, each entry in the table contains the next forwarding hop node used in the path to the destination irrespective of the fact that whether they are presently participating in the communication or not. The table is updated periodically to reflect the changes in the network topology and should be broadcast to the neighbours. After analysing all routes, the shortest route will be chosen through shortest path algorithm to each possible destination in the table. Examples are FSR (Fisheye State Routing Protocol), DSDV (Destination Sequenced Distance Vector Routing Protocol), and Optimized Link State Routing (OLSR) B. Reactive Routing Protocols: Reactive (On-Demand) protocols do not continuously exchange routing information with the neighbor nodes, instead a route is determined on a demand and maintain only those routes that are needed in current communication. When a source node needs to find a route to the destination node, it starts a route discovery process in which the query packets are flooded into the network for the path search. The destination node responds for establishing a route and this phase completes when route is found. Examples are AODV, DSR, TORA. • Simulation Setup In this work we employed OPNET Modeler 16.0 for simulation. A campus network was modelled within an area of 50*50 KM. The all mobile nodes were spread within the area. In Table I describe the simulation parameters that are used in this simulation in order to evaluate and compare the performance of two selected routing protocols (OLSR, DSR) over a MANET network. Each scenario was run for 1800 seconds (simulation time). Under each simulation we check the behavior of OLSR and DSR routing protocol with constant pause time. For examining average statistics of the network load, delay and throughput for the OLSR and DSR routing protocol of WSN we collected DES (global discrete event statistics) on each protocol and Wireless LAN. We take the FTP traffic in the application configuration object this sets the application to model the high load FTP traffic for analyse the effects on routing protocols. International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 784 www.ijergs.org Figure 2: WSN Scenario Table I Simulation Parameters Simulation Parameters Examined Protocols OLSR and DSR Number of Nodes 100,150,200, 250 and 300 Types of Nodes Static Simulation Area 50*50 KM Simulation Time 1800 seconds Pause Time 200 s Performance Parameters Throughput, Delay, Network load Traffic type FTP Mobility model used Random waypoint Data Type Constant Bit Rate (CBR) Packet Size 512 bytes Trajectory VECTOR Long Retry Limit 4 Max Receive Lifetime 0.5 seconds Buffer Size(bits) 25600 Physical Characteristics IEEE 802.11g (OFDM) Data Rates(bps) 54 Mbps Transmit Power 0.005 RTS Threshold 1024 Packet-Reception Threshold -95 Table II Scenario used Scenarios Nodes and Its Types Protocol Scenario 1 100 Static Nodes OLSR Scenario 2 100 Static Nodes DSR Scenario 3 150 Static Nodes OLSR Scenario 4 150 Static Nodes DSR Scenario 5 200 Static Nodes OLSR Scenario 6 200 Static Nodes DSR Scenario 7 250 Static Nodes OLSR Scenario 8 250 Static Nodes DSR International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 785 www.ijergs.org In profile configuration object we configured the profile with high load FTP application. The default random waypoint mobility model was used in this simulation. Mobile nodes in all scenarios moving with pause time are 200 seconds. • Performance Metrics: We have primarily selected the following three performance metrics in order to study the performance comparison of OLSR and DSR. End to End Delay The packet end to end delay is the average time that packets take to traverse in the network. Delay is the total time taken by the packets to reach from the source to destination. It is expressed in seconds. Hence all the delays in the network are called packet endto-end delay. It includes all the delays in the network such as propagation delay (PD), processing delay (PD), transmission delay (TD), queuing delay (QD). Network Load Network load can be define as the total amount of data traffic being carried by the network .When there is more traffic coming on the network, and it is difficult for the network to handle all this traffic so it is called the network load. High network load affects the WSN routing packets that reduce the delivery of packets for reaching to the channel. Throughput Throughput can be defined as the ratio of the total amount of data reaches a destination from the source. The time it takes by the destination to receive the last message is called as throughput. It is expressed as bytes or bits per seconds (byte/sec or bit/sec). It can expressed as • Result and Analysis The simulation result shows the performance behavior of the considered protocols in terms of network load, end to end delay and throughput. Figure 3–6 depicts the performance on the basis of network load with varying number of nodes. From graph results it is observed that DSR has less average network load as compared to the OLSR routing protocol. DSR has less average network load because of its on demand routing characteristics so there is no need to update the routing table. Figure 7–10 depicts the performance on the basis of end to end delay with varying number of nodes. From graph results it is observed that DSR shows higher end to end delay as compared to OLSR due to the reason that when a RREQ is sent, the destination replies to all RREQ it received, which make it slower to determine the least congested route. In OLSR, every destination replies to only first RREQ. Figure 11–14 depicts the performance on the basis of throughput with varying number of nodes. Here we see that OLSR shows very high average throughput as compared to DSR that shown in figure 6.12.Because OLSR is highly reliable in terms of large-scale environment and high-speed. The reason for high throughput of OLSR in comparison with other protocols is that, for OLSR routing paths are easily available due to the characteristic of proactive routing protocols. International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 786 www.ijergs.org Figure 3: Network load of OLSR and DSR for 100 Static nodes. Figure 4: Network load of OLSR and DSR for 150 Static nodes. Figure 5: Network load of OLSR and DSR for 200 Static nodes. Figure 6: Network load of OLSR and DSR for 250 Static nodes International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 787 www.ijergs.org Figure 7: End to End Delay of OLSR and DSR for 100 Static nodes Figure 8: End to End Delay of OLSR and DSR for 150 Static nodes Figure 9: End to End Delay of OLSR and DSR for 200 Static nodes International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 788 www.ijergs.org Figure 10: End to End Delay of OLSR and DSR for 250 Static nodes Figure 11: Throughput of OLSR and DSR for 100 Static nodes. Figure 12: Throughput of OLSR and DSR for 150 Static nodes International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 789 www.ijergs.org Figure 13: Throughput of OLSR and DSR for 200 Static nodes. Figure 14: Throughput of OLSR and DSR for 250 Static nodes. • Conclusion: This paper described a performance evaluation and comparison between two routing protocols (OLSR, DSR) for Wireless Sensor Networks. Both protocols were simulated using OPNET 16.0 and were compared in terms of end to end delay , throughput and network load with varying number of nodes (100, 150, 200, 250, 300). From the simulation result in section we can conclude that average throughput of OLSR in all scenarios is much better than DSR and average end to end delay of DSR is much higher than OLSR and in terms of network load DSR shows less average network load as compared to OLSR routing protocol. REFERENCES: [1] Ait Ali, K.; Baala, O.; Caminada, A., "Routing Mechanisms Analysis in Wireless Sensor Networks(WSN),"in Proceedings of Ad hoc Networks Technology Conference , 2011 IEEE 73rd ,May 2011,pp.15-18. [2] Chowdhury, S.I.; Won-Il Lee; Youn-Sang Choi; Guen-Young Kee; Jae-Young Pyun, "Performance evaluation of reactive routing protocols in Wireless Sensor Networks," in proceeding of Communications (APCC), 2011 17th Asia-Pacific Conference on ad hoc networks ,2011, pp.559,564. [3] ChenY. S., Y. W. Lin, and S. L. Lee, “A mobicast routing protocol for Wireless Sensor Networks(WSN)” in Proceedings of ACM/Springer Mobile Networks and Applications, Vol. 15, 2010, pp.20-35. [4] Skordylis A. and TrigoniN., “Delay-bounded routing in Wireless Sensor Networks(WSN),”in Proceedings of ACM International Symposium on Mobile Ad hoc Networking and Computing, 2008, pp. 3020-3026. International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 790 www.ijergs.org [5] Saha A. K. and Johnson D.B., “Modelling the mobility for Wireless Sensor Networks(WSN),”in Proceedings of ACM International Workshop on Ad Hoc Networks,2004, pp. 91-96. [6] Vidhale, B.; Dorle, S.S., "Performance Analysis of Routing Protocols in Realistic Environment for Wireless Sensor Networks(WSN)," in Proceedings of Systems Engineering (ICSEng), 2011 21st International Conference on , vol.2,Aug. 2011, pp.267-272. [7] YamaguchiH., K. Yukimasa, and S. Kusumoto, “QoS routing Protocol for Wireless Sensor Networks(WSN),” in Proceedings of IEEE International Workshopon Quality of Service, 2006, pp. 132-139. [8] Ding Y, Borcea C, Xiao L “A static-node assisted adaptive routing protocol in Wireless Sensor Networks (WSN)” In Proceedings of the ACM international Workshop on Wireless Sensor Networks (WSN), 2007, pp 59–68. [9] Manvi S., Kakkasageri M.S., Mahapurush , “Performance Analysis of AODV, DSR, Routing Protocols In Wireless Sensor Networks(WSN)” In Proceedings of International conference on future Computer and Communication., April. 2009. pp. 21-26. [10] Bernsen, J. Manivannan, “Routing Protocols for Wireless Sensor Networks(WSN) That Ensure Quality of Service” InProceedings of the fourth international conference on Wireless and Mobile Communications., Aug. 2008, pp.1-6. [11] TalebT., E. Sakhaee, A. Jamalipour, K. Hashimoto, N. Kato, and Y. Nemoto, “A stable routing protocol to support its services inWireless Sensor Networks(WSN)” in Proceedings of IEEE Transactions on Wireless and Mobile Communications, vol. 56, no. 6,November 2007, pp.3337–3347. [12] GoelA., Ramakrishnan K. G., D. Kataria, and D. Logothetis, “Efficient computation of delay-sensitive routes from one source to all destinations,” in Proceedings of IEEEConference on Computer Communications, 2001, pp. 854-858. [13] BlumJ., Eskandarian A., and Hoffman L. "Performance Characteristics of Wireless Sensor Networks (WSN)". In Proceedings of IEEE 6th International Conference on Computer Communications, Shanghai, China,2004, Pp. 115-119. [14] H. Wu, Fujimoto, R., Guensler, R., and Hunter, M, “MDDV: a mobility-centric data dissemination algorithm for Wireless Sensor Networks (WSN),” in Proceedings of the 1st ACM international Workshop on Wireless Sensor Networks ,October, 2004,pp. 47-56. [15] BalonN., and J. Guo, “Increasing Broadcast Reliability in Wireless Sensor Networks,” In Proceeding of the 3rd ACM International Workshop on Ad Hoc Networks, NY, USA, 2006, pp. 104-105. [16] Jorjeta G. Jetcheva, Yih-Chun Hu, Amit Kumar Saha, and David B. Johnson. “Design and Evaluation of a Metropolitan Area Multitier Wireless Ad Hoc Network Architecture in Wireless Sensor Networks”. In Proceedings of the Fifth IEEE Workshop on Mobile Computing Systems & Applications, Monterey, CA, Oct. 2003,pp 32-37. [17] Tseng Y.C., Y.S. Chen, and J.P. Sheu, "The broadcast storm problem in a mobile ad hoc network(MANET)," In Proceeding of the 5th ACM/IEEE International Conference on Mobile Computing and Networking, NY, USA,1999, pp. 51-162. [18] H. Safa, H. Artail, and R. Shibli, “An interoperability model for supporting reliability and power-efficient routing in Wireless Sensor Networks,” International Journal of Ad Hoc and Ubiquitous Computing, Vol. 4, 2009, pp. 74-83. [19] T. Sawamura, K. Tanaka, M. Atajanov , N. Matsumoto, and N. Yoshida, “Adaptive router promotion and group forming in ad-hoc networks,” in Proceedings of International Journal of Ad Hoc and Ubiquitous Computing, Vol. 3, 2008, pp. 217-223. [20] Heissenbüttel M., T. Braun, M. Wälchli, and T. Bernoulli, “Optimized stateless broadcasting in wireless multi-hop networks,” in proceeding of 4 IEEE international conference on Infocom Barcelona,2006, pp.234-250. [21] Sommer, C.; Dietrich, I.; Dressler, F. “Realistic Simulation of Network Protocols in WSN Scenarios” in Proceedings of International Journal of Ad Hoc and Ubiquitous Computing, Vol. 3, 2008, pp. 217-223. [22] Tseng Y.C., Y.S. Chen, and J.P. Sheu, "The broadcast storm problem in a Wireless Sensor Networks, " In Proceeding of the 5th ACM/IEEE International Conference on Mobile Computing and Networking, NY, USA,1999, pp. 51-162. [23] Korkmaz G., E. Ekici, F. Ozgüner, and U. Ozgüner, "Urban multi-hop broadcast protocol for Wireless Sensor Networks," In Proceeding of the 1st ACM International Workshop on Ad Hoc Networks, NY, USA, 2004,pp. 76-85. [24] Rajive Bagrodia, Richard Meyer, Mineo Takai, Yu an Chen, Xiang Zeng, Jay Martin, and Ha Yoon Song. “A parallel simulation environment for complex systems” in Proceedings of the 1st ACM international workshop on ad hoc networks; 2004; Pages: 66 – 75. [25] Brian D. Noble, Jungkeun Yoon ,Mingyan Liu, Minkyong Kim, ”Building realistic mobility models in Wireless Sensor Networks”, in Proceeding of the ACM International Conference On Mobile Systems, Applications And Services, pp. 177-190, 2006. [26] Fan Li and Yu Wang; “Survey of Routing in Wireless Sensor Networks”, in Proceedings of IEEE Wireless Sensor Networks Technology Magazine, Volume 2, Issue 2, June 2007; pp. 12-22. [27] Jahanzeb Farooq, Bilal Rauf “ Implementation and Evaluation of IEEE 802.11e Wireless LAN in GloMoSim” In Proceeding of the 1st ACM International Workshop on Ad Hoc Networks, NY, USA, 2004,pp. 76-85. International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730 791 www.ijergs.org [28] Yue Liu, Jun Bi, Ju Yang; “Research on Wireless Sensor Networks” in Proceedings of Chinese Control and Decision Conference (CCDC), 2009, pp.4430 – 4435. [29] Abedi, O.; Berangi, R.; Azgomi, M.A., "Improving Route Stability and Overhead on AODV Routing Protocol and Make it Usable for Wireless Sensor Networks," in Proceedings of 29th IEEE International Conference on Wireless Sensor Networks, June 2009, pp.464,467. [30] Chowdhury, S.I.; Won-Il Lee; Youn-Sang Choi; Guen-Young Kee; Jae-Young Pyun, "Performance evaluation of reactive routing protocols in Wireless Sensor Networks," in proceeding of Communications (APCC), 2011 17th Asia-Pacific Conference on ad hoc networks ,2011, pp.559,564. [31] Sun Xi; Xia-Miao Li, "Study of the Feasibility of Wireless Sensor Networks and its Routing Protocols," in proceeding of Wireless Communications, Networking and Mobile Computing, 2008. 4th International Conference on ad hoc networks, 2008, pp.1-4. [32] Vinod Namboodiri, Manish Agarwal, Lixin Gao; “A Study on the Feasibility of Mobile Gateways for Wireless Sensor Networks”, in proceeding of Wireless Communications Networking and Mobile Computing 6th International Conference on 2010,Sept. 2010, pp.1,4, 23-25. [33] Siva D., Abu B. Sesay, and Witold A. Krzymie ́n, “A Design on Routing Protocol in Sensor Networks Based on Clustering Optimization” In Proceedings of 2nd International Conference on Future Computer and Communication,2010, pp 473-477. [34] C. Y. Wan, S. B. Eisenman, and A. T. Campbell,, “CODA: Congestion Detection and Avoidance in Sensor Networks,” In Proceedings of First ACM Conference on Embedded Networked Sensor Systems,2003,pp.266-279. [35] R.U.Anitha, P. Kamalakkannan ,“Enhanced Cluster Based Routing Protocol for MobileNodes in Wireless Sensor Network” In Proceedings of 2013 International Conference onPattern Recognition, Informatics and Mobile Engineering (PRIME), 2006,PP 187-193.